Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory

A Graph-Based Approach to Symmetry Detection

Symmetry detection aims at discovering redundancy in the form of reoccurring structures in geometric objects. In this paper, we present a new symmetry detection algorithm for geometry represented as point clouds that is based on analyzing a graph of surface features. We combine a general feature detection scheme with a RANSAC-based randomized subgraph searching algorithm in order to reliably de...

On Szeged Polynomial of a Graph

A Polynomial Reduction from ASPDA to ASP

ASPDA is a framework for expressing defeasibility in Answer Set Programs via so-called argumentation theories, proposed by Wan, Kifer, and Grosof in [2]. The authors describe a reduction from ASPDA to plain Answer Set Programming, which however exponentially inflate programs. In this note, we present an alternative reduction, which does not suffer from this problem. As a side-effect, complexity...

A Polynomial - Time Reduction from Bivariate to Univariate Integral Polynomial

A Abstract n algorithm is presented which reduces the prob-m lem of finding the irreducible factors of a bivariate polyno-ial with integer coefficients in polynomial time in the total i degree and the coefficient lengths to factoring a univariate nteger polynomial. Together with A. Lenstra's, H. Lenstra's u and L. Lovasz' polynomial-time factorization algorithm for nivariate integer polynomials...

Reduction theory for symmetry breaking

We formulate Euler-Poincaré equations for systems with broken symmetry. In particular, we consider the action of a Lie group O (the broken symmetry) on a manifold M , thereby extending the well known case when M is a vector space. In condensed matter physics, M is known as the order parameter space and we provide several examples of how the present treatment applies in this framework, with spec...